On Adaptive-Step Primal-Dual Interior-Point Algorithms for Linear Programming
نویسندگان
چکیده
منابع مشابه
On Adaptive-Step Primal-Dual Interior-Point Algorithms for Linear Programming
Interior point methods were widely used in the past in the form of barrier methods. In linear programming, the simplex method dominated, mainly due to inefficiencies of barrier methods. Interior point methods became quit popular again after 1984, when Karmarkar announced a fast polynomial-time interior method for nonlinear programming [Karmarkar, 1984]. In this section we present primal-dual in...
متن کاملTheoretical convergence of large-step primal-dual interior point algorithms for linear programming
This paper proposes two sets of rules Rule G and Rule P for controlling step lengths in a generic primal dual interior point method for solving the linear program ming problem in standard form and its dual Theoretically Rule G ensures the global convergence while Rule P which is a special case of Rule G ensures the O nL iteration polynomial time computational complexity Both rules depend only o...
متن کاملA Primal-Dual Interior Point Algorithm for Linear Programming
This chapter presents an algorithm that works simultaneously on primal and dual linear programming problems and generates a sequence of pairs of their interior feasible solutions. Along the sequence generated, the duality gap converges to zero at least linearly with a global convergence ratio (1 Yf/n); each iteration reduces the duality gap by at least Yf/n. Here n denotes the size of the probl...
متن کاملOn Extending Some Primal-Dual Interior-Point Algorithms From Linear Programming to Semidefinite Programming
This work concerns primal-dual interior-point methods for semideenite programming (SDP) that use a search direction originally proposed by Helmberg-Rendl-Vanderbei-Wolkowicz 5] and Kojima-Shindoh-Hara 11], and recently rediscovered by Monteiro 15] in a more explicit form. In analyzing these methods, a number of basic equalities and inequalities were developed in 11] and also in 15] through diie...
متن کاملPrimal-dual entropy-based interior-point algorithms for linear optimization
We propose a family of search directions based on primal-dual entropy in the contextof interior-point methods for linear optimization. We show that by using entropy based searchdirections in the predictor step of a predictor-corrector algorithm together with a homogeneousself-dual embedding, we can achieve the current best iteration complexity bound for linear opti-mization. The...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Mathematics of Operations Research
سال: 1993
ISSN: 0364-765X,1526-5471
DOI: 10.1287/moor.18.4.964